Finding Maximally Satisfiable Terminologies for the Description Logic ALC
نویسندگان
چکیده
For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such problems. One possible remedy is to weaken the available information to the extent that the errors disappear, but to limit the weakening process as much as possible. The most obvious way to do so is to remove just enough Tbox sentences to eliminate the errors. In this paper we propose a tableaulike procedure for finding maximally concept-satisfiable terminologies represented in the description logic ALC. We discuss some optimisation techniques, and report on preliminary, but encouraging, experimental results.
منابع مشابه
Computing Maximally Satisfiable Terminologies for the Description Logic ALC with Cyclic Definitions
Existing description logic reasoners provide the means to detect logical errors in ontologies, but lack the capability to resolve them. We present a tableaubased algorithm for computing maximally satisfiable terminologies in ALC. Our main contribution is the ability of the algorithm to handle GCIs, using a refined blocking condition that ensures termination is achieved at the right point during...
متن کاملFinite Model Reasoning in ALCQI is EXPTIME Logics
Most description logics (DLs) enjoy the finite model property (FMP). This is, for example, the case for ALC [14] and many of its extensions such as ALCI (ALC with inverse roles) and ALCQ (ALC with qualifying number restrictions): for any of these logics L, each satisfiable L-concept has a finite model. This even holds if we consider concept satisfiability w.r.t. general TBoxes. However, there a...
متن کاملGeneralized Complexity of ALC Subsumption
The subsumption problem with respect to terminologies in the description logic ALC is EXP-complete. We investigate the computational complexity of fragments of this problem by means of allowed Boolean operators. Hereto we make use of the notion of clones in the context of Post’s lattice. Furthermore we consider all four possible quantifier combinations for each fragment parameterized by a clone...
متن کاملDistributed Resolution for ALC
The use of Description Logic as the basis for Semantic Web Languages has led to new requirements with respect to scalable and nonstandard reasoning. In this paper, we address the problem of scalable reasoning by proposing a distributed, complete and terminating algorithm that decides satisfiability of terminologies in ALC. The algorithm is based on recent results on applying resolution to descr...
متن کاملDistributed Resolution for ALC - First Results
The use of description logic as the basis for semantic web languages has led to new requirements with respect to scalable and non-standard reasoning. Description logic is a decidable fragment of FOL but still, the standard reasoning tasks are of exponential complexity, satisfiability and subsumption tests are often intractable on large ontologies. Existing large ontologies have a modular struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006